A General State-Space Formulation for Online Scheduling
نویسندگان
چکیده
منابع مشابه
A General State-Space Formulation for Online Scheduling
We present a generalized state-space model formulation particularly motivated by an 1 online scheduling perspective. Through these proposed generalizations, we enable a natural way 2 to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. 3 Thereby, greatly simplifying and extending the possible application of mathematical programming 4 based online sched...
متن کاملOnline State Space Model Parameter Estimation in Synchronous Machines
The purpose of this paper is to present a new approach based on the Least Squares Error method for estimating the unknown parameters of the nonlinear 3rd order synchronous generator model. The proposed method uses the mathematical relationships between the machine parameters and on-line input/output measurements to estimate the parameters of the nonlinear state space model. The field voltage is...
متن کاملA General Boundary-Integral Formulation for Zoned Three-Dimensional Media
A new boundary-integral formulation is proposed to analyze the heat transfer in zoned three-dimensional geometries. The proposed formulation couples the boundary formula, the gradient of the boundary formula, and the exterior formula. An advantage of this formulation over the traditional methods is that any linear condition at the interface between subdomains may be incorporated into the formul...
متن کاملParallelizing State Space Plans Online
Searching for parallel solutions in state space planners is a challenging problem, because it would require the planners to branch on all possible subsets of parallel actions, exponentially increasing their branching factor. We introduce a variant of our heuristic state search planner AltAlt, which generates parallel plans by using greedy online parallelization of partial plans. Empirical resul...
متن کاملOnline scheduling with general cost functions
We consider a general online scheduling problem on a single machine with the objective of minimizing ∑ j wjg(Fj), where wj is the weight/importance of job Jj , Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective. We show that the scheduling algorithm Highest Density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2017
ISSN: 2227-9717
DOI: 10.3390/pr5040069